A genetic algorithm with memory for mixed discrete–continuous design optimization
نویسندگان
چکیده
منابع مشابه
A genetic algorithm with memory for mixed discrete-continuous design optimization
This paper describes a new approach for reducing the number of the fitness function evaluations required by a genetic algorithm (GA) for optimization problems with mixed continuous and discrete design variables. The proposed additions to the GA make the search more effective and rapidly improve the fitness value from generation to generation. The additions involve memory as a function of both d...
متن کاملA Particle Swarm Optimization Algorithm for Mixed-Variable Nonlinear Problems
Many engineering design problems involve a combination of both continuous anddiscrete variables. However, the number of studies scarcely exceeds a few on mixed-variableproblems. In this research Particle Swarm Optimization (PSO) algorithm is employed to solve mixedvariablenonlinear problems. PSO is an efficient method of dealing with nonlinear and non-convexoptimization problems. In this paper,...
متن کاملDesign of PID Controller for Teleopration System with Genetic Algorithm
This paper presents a novel teleoperation controller for a nonlinear master–slave robotic system with constant time delay in communication channel. The proposed controller enables the teleoperation system to compensate human and environmental disturbances, while achieving master and slave position coordination in both free motion and contact situation. The current work basically extends the pas...
متن کاملFacade Design Optimization for Daylight with a Simple Genetic Algorithm
The aim of the present study was to determine the applicability of a genetic algorithm for the optimization of daylighting systems, as well as the requirements for the lighting simulations to be used. Furthermore, by testing the daylighting performance of a building's facade when several parameters are allowed to change simultaneously, the results were used as a complement of previous parametri...
متن کاملChaotic Genetic Algorithm based on Explicit Memory with a new Strategy for Updating and Retrieval of Memory in Dynamic Environments
Many of the problems considered in optimization and learning assume that solutions exist in a dynamic. Hence, algorithms are required that dynamically adapt with the problem’s conditions and search new conditions. Mostly, utilization of information from the past allows to quickly adapting changes after. This is the idea underlining the use of memory in this field, what involves key design issue...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Structures
سال: 2003
ISSN: 0045-7949
DOI: 10.1016/s0045-7949(03)00253-0